Second-order cone programming approach for elliptically distributed joint probabilistic constraints with dependent rows
نویسندگان
چکیده
In this paper, we investigate the problem of linear joint probabilistic constraints. We assume that the rows of the constraint matrix are dependent and the dependence is driven by a convenient Archimedean copula. Further we assume the distribution of the constraint rows to be elliptically distributed, covering normal, t, or Laplace distributions. Under these and some additional conditions, we prove the convexity of the investigated set of feasible solutions. We also develop two approximation schemes for this class of stochastic programming problems based on second-order cone programming, which provides lower and upper bounds. Finally, a computational study on randomly generated data is given to illustrate the tightness of these bounds.
منابع مشابه
Second-order cone programming formulation for two player zero-sum game with chance constraints
We consider a two player finite strategic zero-sum game where each player has stochastic linear constraints. We formulate the stochastic constraints of each player as chance constraints. We show the existence of a saddle point equilibrium if the row vectors of the random matrices, defining the stochastic constraints of each player, are elliptically symmetric distributed random vectors. We furth...
متن کاملSolving A Fractional Program with Second Order Cone Constraint
We consider a fractional program with both linear and quadratic equation in numerator and denominator having second order cone (SOC) constraints. With a suitable change of variable, we transform the problem into a second order cone programming (SOCP) problem. For the quadratic fractional case, using a relaxation, the problem is reduced to a semi-definite optimization (SDO) program. The p...
متن کاملWaveform Design using Second Order Cone Programming in Radar Systems
Transmit waveform design is one of the most important problems in active sensing and communication systems. This problem, due to the complexity and non-convexity, has been always the main topic of many papers for the decades. However, still an optimal solution which guarantees a global minimum for this multi-variable optimization problem is not found. In this paper, we propose an attracting met...
متن کاملChance-Constrained Model Predictive Control for Drinking Water Networks
This paper addresses a chance-constrained model predictive control (CC-MPC) strategy for the management of drinking water networks (DWNs) based on a finite horizon stochastic optimisation problem with joint probabilistic (chance) constraints. In this approach, water demands are considered additive stochastic disturbances with non-stationary uncertainty description, unbounded support and known (...
متن کاملElectricity Procurement for Large Consumers with Second Order Stochastic Dominance Constraints
This paper presents a decision making approach for mid-term scheduling of large industrial consumers based on the recently introduced class of Stochastic Dominance (SD)- constrained stochastic programming. In this study, the electricity price in the pool as well as the rate of availability (unavailability) of the generating unit (forced outage rate) is considered as uncertain parameters. Th...
متن کامل